By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 21, Issue 4, pp. 823-1092

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Neighborhood Broadcasting in Hypercubes

Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, and Joseph G. Peters

pp. 823-843

BibTeX  Abstract Full Text:  PDF

Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions

Hong-Jian Lai

pp. 844-850

BibTeX  Abstract Full Text:  PDF

On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks

Gennian Ge and Alan C. H. Ling

pp. 851-864

BibTeX  Abstract Full Text:  PDF

Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields

Harald Niederreiter and Ferruh Özbudak

pp. 865-899

BibTeX  Abstract Full Text:  PDF

The Complexity of the List Partition Problem for Graphs

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, and R. Sritharan

pp. 900-929

BibTeX  Abstract Full Text:  PDF

Lower Bounds on Locality Sensitive Hashing

Rajeev Motwani, Assaf Naor, and Rina Panigrahy

pp. 930-935

BibTeX  Abstract Full Text:  PDF

A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph

Ken Takata

pp. 936-946

BibTeX  Abstract Full Text:  PDF

On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem

B. Pittel, L. Shepp, and E. Veklerov

pp. 947-958

BibTeX  Abstract Full Text:  PDF

Constant Weight Conflict-Avoiding Codes

Koji Momihara, Meinard Müller, Junya Satoh, and Masakazu Jimbo

pp. 959-979

BibTeX  Abstract Full Text:  PDF

Ramsey Numbers and the Size of Graphs

Benny Sudakov

pp. 980-986

BibTeX  Abstract Full Text:  PDF

On $k$-Term DNF with the Largest Number of Prime Implicants

Robert H. Sloan, Balázs Szörényi, and György Turán

pp. 987-998

BibTeX  Abstract Full Text:  PDF

Coloring Bull-Free Perfectly Contractile Graphs

Benjamin Lévêque and Frédéric Maffray

pp. 999-1018

BibTeX  Abstract Full Text:  PDF

Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets

Moshe Dror and James B. Orlin

pp. 1019-1034

BibTeX  Abstract Full Text:  PDF

Average Distance and Edge-Connectivity II

Peter Dankelmann, Simon Mukwembi, and Henda C. Swart

pp. 1035-1052

BibTeX  Abstract Full Text:  PDF

Explicit Construction of Small Folkman Graphs

Linyuan Lu

pp. 1053-1060

BibTeX  Abstract Full Text:  PDF

Nonseparating Induced Cycles Consisting of Contractible Edges in $k$-Connected Graphs

Yoshimi Egawa, Katsumi Inoue, and Ken-ichi Kawarabayashi

pp. 1061-1070

BibTeX  Abstract Full Text:  PDF

Matched-Factor $d$-Domatic Coloring of Graphs

K. S. Sudeep and Sundar Vishwanathan

pp. 1071-1082

BibTeX  Abstract Full Text:  PDF

Cycle Systems in the Complete Bipartite Graph Plus a One-Factor

Liqun Pu, Hao Shen, Jun Ma, and San Ling

pp. 1083-1092

BibTeX  Abstract Full Text:  PDF